# negligible probability

﻿
negligible probability
пренебрежимо малая вероятность.

English-Russian cryptological dictionary . 2014.

### Смотреть что такое "negligible probability" в других словарях:

• Negligible function — For other uses, see negligible. In mathematics, a negligible function is a function such that for every positive integer c there exists an integer Nc such that for all x > Nc, Equivalently, we may also use the following definition. A …   Wikipedia

• probability theory — Math., Statistics. the theory of analyzing and making statements concerning the probability of the occurrence of uncertain events. Cf. probability (def. 4). [1830 40] * * * Branch of mathematics that deals with analysis of random events.… …   Universalium

• negligible — I (New American Roget s College Thesaurus) adj. slight, insignificant. See littleness, unimportance. II (Roget s 3 Superthesaurus) a. minute, minimal, insignificant, inconsequential, trifling, nominal, piddling, paltry, imperceptible, unimportant …   English dictionary for students

• Universal probability bound — A universal probability bound is a probabilistic threshold whose existence is asserted by William A. Dembski and is used by him in his works promoting intelligent design. It is defined as A degree of improbability below which a specified event of …   Wikipedia

• Infinite divisibility (probability) — In probability theory, to say that a probability distribution F on the real line is infinitely divisible means that if X is any random variable whose distribution is F , then for every positive integer n there exist n independent identically… …   Wikipedia

• Differential diagnosis — Intervention MeSH D003937 A differential diagnosis (sometimes abbreviated DDx, ddx, DD, D/Dx, or ΔΔ) is a systematic diagnostic method used to identify the presence of an entity where multiple alternatives are …   Wikipedia

• Forking lemma — The forking lemma is any of a number of related lemmas in cryptography research. The lemma states that if an adversary (typically a probabilistic Turing machine), on inputs drawn from some distribution, produces an output that has some property… …   Wikipedia

• Shannon's source coding theorem — In information theory, Shannon s source coding theorem (or noiseless coding theorem) establishes the limits to possible data compression, and the operational meaning of the Shannon entropy.The source coding theorem shows that (in the limit, as… …   Wikipedia

• Trembling hand perfect equilibrium — Infobox equilibrium name=(Normal form) trembling hand perfect equilibrium subsetof=Nash Equilibrium supersetof=Proper equilibrium discoverer=Reinhard Selten: This article is about games. For the cocktail, see Perfect Equilibrium (Cocktail)… …   Wikipedia

• Sexually transmitted disease — Classification and external resources …   Wikipedia

• Collision (computer science) — Not to be confused with wireless packet collision. In computer science, a collision or clash is a situation that occurs when two distinct pieces of data have the same hash value, checksum, fingerprint, or cryptographic digest. Collisions are… …   Wikipedia

### Поделиться ссылкой на выделенное

##### Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.